Applying Ahuja-Orlin’s Large Neighbourhood for Constructing Examination Timetabling Solution
نویسنده
چکیده
1 Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science & Information Technology, University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, United Kingdom 2 School of Computing, De Montfort University, The Gateway, Leicester LE1 9BH, United Kingdom 3 MIS Department, College of Business and Public Administration, University of Arizona, Tucson, Arizona 85721, USA
منابع مشابه
Investigating Ahuja-Orlin’s Large Neighbourhood Search Approach for Examination Timetabling
Since the 1960’s, automated approaches to examination timetabling have been explored and a wide variety of approaches have been investigated and developed. In this paper we build upon a recently presented, sequential solution improvement technique which searches efficiently over a very large set of ‘adjacent’ (neighbourhood) solutions. This solution search methodology, originally developed by A...
متن کاملInvestigating Ahuja-Orlin's Large Neighbourhood Search for Examination Timetabling
Since the 1960’s automated approaches to examination timetabling have been explored and a wide variety of approaches have been investigated and developed. In this paper we build upon a recently presented, sequential solution improvement technique which searches efficiently over a very large set of ‘adjacent’ (neighbourhood) solutions. This solution search methodology, originally developed by Ah...
متن کاملMulti-Neighbourhood Local Search for Course Timetabling
One of the most critical features for applying local search to timetabling problems is the definition of the neighbourhood structure. In fact, for most common timetabling problems, there is more than one neighbourhood structure that is sufficiently natural and intuitive to deserve investigation. The reason for considering combination of diverse neighbourhood is related to the diversification of...
متن کاملA Multi-Start Very Large Neighbourhood Search Approach with Local Search Methods for Examination Timetabling
This paper investigates a hybridisation of the very large neighbourhood search approach with local search methods to address examination timetabling problems. In this paper, we describe a 2 phase approach. The first phase employs “multi start” to carry out search upon a very large neighbourhood of solutions using graph theoretical algorithms implemented on an improvement graph. The second phase...
متن کاملAn Investigation of Variable Neighbourhood Search for University Course Timetabling
The university course timetabling problem consists, in essence, of assigning lectures to a specific timeslot and room. The goal is to satisfy as many soft constraints as possible while constructing a feasible schedule. In this paper, we present a variable neighbourhood search approach with an exponential monte carlo acceptance criteria. This heuristic search approach is based on random-descent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004